Very-Large-Scale Generalized Combinatorial Multi-Attribute Auctions: Lessons from Conducting $60 Billion of Sourcing
نویسنده
چکیده
Drawing from our experiences of designing and fielding over 800 sourcing auctions totaling over $60 billion, I will discuss issues that arise in very-large-scale generalized combinatorial auctions, as well as solutions that work (and ones that do not). These are by far the largest (in terms of the number of items as well as the number of side constraints) and most complex combinatorial markets ever developed.
منابع مشابه
A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملExpressiveness in Mechanisms and its Relation to Efficiency: Our Experience from $40 Billion of Combinatorial Multi-attribute Auctions, and Recent Theory
A recent trend (especially in electronic commerce) is higher levels of expressiveness in the mechanisms that mediate interactions such as auctions, exchanges, catalog offers, voting systems, matching of peers, and so on. Participants can express their preferences in drastically greater detail than ever before. In many cases this trend is fueled by modern algorithms for winner determination that...
متن کاملExpressiveness in Mechanisms and its Relation to Efstciency: Our Experience from $40 Billion of Combinatorial Multi-attribute Auctions, and Recent Theory
A recent trend (especially in electronic commerce) is higher levels of expressiveness in the mechanisms that mediate interactions such as auctions, exchanges, catalog offers, voting systems, matching of peers, and so on. Participants can express their preferences in drastically greater detail than ever before. In many cases this trend is fueled by modern algorithms for winner determination that...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملDecision support for preference elicitation in multi-attribute electronic procurement auctions through an agent-based intermediary
a r t i c l e i n f o Multi-attribute auctions have become increasingly popular in enterprise procurement. In the auctions, the elicitation of the preference of an auctioneer concerning multiple attributes is a central task in determining the winner(s). Considering the difficulty of explicit elicitation, a preference elicitation framework is proposed to assist the auctioneer in inferring his/he...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012